Annotations for Rule-Based Models

The chapter reviews the syntax to store machine-readable annotations and describes the mapping between rule-based modelling entities (e.g., agents and rules) and these annotations. In particular, we review an annotation framework and the associated guidelines for annotating rule-based models of molecular interactions, encoded in the commonly used Kappa and BioNetGen languages, and present prototypes that can be used to extract and query the annotations. An ontology is used to annotate models and facilitate their description

Exact model reduction of combinatorial reaction networks

Receptors and scaffold proteins usually possess a high number of distinct binding domains inducing the formation of large multiprotein signaling complexes. Due to combinatorial reasons the number of distinguishable species grows exponentially with the number of binding domains and can easily reach several millions. Even by including only a limited number of components and binding domains the resulting models are very large and hardly manageable. A novel model reduction technique allows the significant reduction and modularization of these models

ALC: automated reduction of rule-based models

<p>Abstract</p> <p>Background</p> <p>Combinatorial complexity is a challenging problem for the modeling of cellular signal transduction since the association of a few proteins can give rise to an enormous amount of feasible protein complexes. The layer-based approach is an approximative, but accurate method for the mathematical modeling of signaling systems with inherent combinatorial complexity. The number of variables in the simulation equations is highly reduced and the resulting dynamic models show a pronounced modularity. Layer-based modeling allows for the modeling of systems not accessible previously.</p> <p>Results</p> <p>ALC (Automated Layer Construction) is a computer program that highly simplifies the building of reduced modular models, according to the layer-based approach. The model is defined using a simple but powerful rule-based syntax that supports the concepts of modularity and macrostates. ALC performs consistency checks on the model definition and provides the model output in different formats (C MEX, MATLAB, <it>Mathematica </it>and SBML) as ready-to-run simulation files. ALC also provides additional documentation files that simplify the publication or presentation of the models. The tool can be used offline or via a form on the ALC website.</p> <p>Conclusion</p> <p>ALC allows for a simple rule-based generation of layer-based reduced models. The model files are given in different formats as ready-to-run simulation files.</p

Depicting combinatorial complexity with the molecular interaction map notation

To help us understand how bioregulatory networks operate, we need a standard notation for diagrams analogous to electronic circuit diagrams. Such diagrams must surmount the difficulties posed by complex patterns of protein modifications and multiprotein complexes. To meet that challenge, we have designed the molecular interaction map (MIM) notation (http://discover.nci.nih.gov/mim/). Here we show the advantages of the MIM notation for three important types of diagrams: (1) explicit diagrams that define specific pathway models for computer simulation; (2) heuristic maps that organize the available information about molecular interactions and encompass the possible processes or pathways; and (3) diagrams of combinatorially complex models. We focus on signaling from the epidermal growth factor receptor family (EGFR, ErbB), a network that reflects the major challenges of representing in a compact manner the combinatorial complexity of multimolecular complexes. By comparing MIMs with other diagrams of this network that have recently been published, we show the utility of the MIM notation. These comparisons may help cell and systems biologists adopt a graphical language that is unambiguous and generally understood

Computational and Mathematical Modelling of the EGF Receptor System

This chapter gives an overview of computational and mathematical modelling of the EGF receptor system. It begins with a survey of motivations for producing such models, then describes the main approaches that are taken to carrying out such modelling, viz. differential equations and individual-based modelling. Finally, a number of projects that applying modelling and simulation techniques to various aspects of the EGF receptor system are described

Exact Hybrid Particle/Population Simulation of Rule-Based Models of Biochemical Systems

Detailed modeling and simulation of biochemical systems is complicated by the problem of combinatorial complexity, an explosion in the number of species and reactions due to myriad protein-protein interactions and post-translational modifications. Rule-based modeling overcomes this problem by representing molecules as structured objects and encoding their interactions as pattern-based rules. This greatly simplifies the process of model specification, avoiding the tedious and error prone task of manually enumerating all species and reactions that can potentially exist in a system. From a simulation perspective, rule-based models can be expanded algorithmically into fully-enumerated reaction networks and simulated using a variety of network-based simulation methods, such as ordinary differential equations or Gillespie's algorithm, provided that the network is not exceedingly large. Alternatively, rule-based models can be simulated directly using particle-based kinetic Monte Carlo methods. This "network-free" approach produces exact stochastic trajectories with a computational cost that is independent of network size. However, memory and run time costs increase with the number of particles, limiting the size of system that can be feasibly simulated. Here, we present a hybrid particle/population simulation method that combines the best attributes of both the network-based and network-free approaches. The method takes as input a rule-based model and a user-specified subset of species to treat as population variables rather than as particles. The model is then transformed by a process of "partial network expansion" into a dynamically equivalent form that can be simulated using a population-adapted network-free simulator. The transformation method has been implemented within the open-source rule-based modeling platform BioNetGen, and resulting hybrid models can be simulated using the particle-based simulator NFsim. Performance tests show that significant memory savings can be achieved using the new approach and a monetary cost analysis provides a practical measure of its utility. © 2014 Hogg et al

Syntactic Markovian Bisimulation for Chemical Reaction Networks

In chemical reaction networks (CRNs) with stochastic semantics based on continuous-time Markov chains (CTMCs), the typically large populations of species cause combinatorially large state spaces. This makes the analysis very difficult in practice and represents the major bottleneck for the applicability of minimization techniques based, for instance, on lumpability. In this paper we present syntactic Markovian bisimulation (SMB), a notion of bisimulation developed in the Larsen-Skou style of probabilistic bisimulation, defined over the structure of a CRN rather than over its underlying CTMC. SMB identifies a lumpable partition of the CTMC state space a priori, in the sense that it is an equivalence relation over species implying that two CTMC states are lumpable when they are invariant with respect to the total population of species within the same equivalence class. We develop an efficient partition-refinement algorithm which computes the largest SMB of a CRN in polynomial time in the number of species and reactions. We also provide an algorithm for obtaining a quotient network from an SMB that induces the lumped CTMC directly, thus avoiding the generation of the state space of the original CRN altogether. In practice, we show that SMB allows significant reductions in a number of models from the literature. Finally, we study SMB with respect to the deterministic semantics of CRNs based on ordinary differential equations (ODEs), where each equation gives the time-course evolution of the concentration of a species. SMB implies forward CRN bisimulation, a recently developed behavioral notion of equivalence for the ODE semantics, in an analogous sense: it yields a smaller ODE system that keeps track of the sums of the solutions for equivalent species.Comment: Extended version (with proofs), of the corresponding paper published at KimFest 2017 (http://kimfest.cs.aau.dk/

Efficient Syntax-Driven Lumping of Differential Equations

We present an algorithm to compute exact aggregations of a class of systems of ordinary differential equations (ODEs). Our approach consists in an extension of Paige and Tarjan’s seminal solution to the coarsest refinement problem by encoding an ODE system into a suitable discrete-state representation. In particular, we consider a simple extension of the syntax of elementary chemical reaction networks because (i) it can express ODEs with derivatives given by polynomials of degree at most two, which are relevant in many applications in natural sciences and engineering; and (ii) we can build on two recently introduced bisimulations, which yield two complementary notions of ODE lumping. Our algorithm computes the largest bisimulations in O(r⋅s⋅logs)O(r⋅s⋅log⁡s) time, where r is the number of monomials and s is the number of variables in the ODEs. Numerical experiments on real-world models from biochemistry, electrical engineering, and structural mechanics show that our prototype is able to handle ODEs with millions of variables and monomials, providing significant model reductions

First Observation of τ→3πηντ\tau\to 3\pi\eta\nu_{\tau} and τ→f1πντ\tau\to f_{1}\pi\nu_{\tau} Decays

We have observed new channels for $\tau$ decays with an $\eta$ in the final state. We study 3-prong tau decays, using the $\eta\to\gamma\gamma$ and \eta\to 3\piz decay modes and 1-prong decays with two \piz's using the $\eta\to\gamma\gamma$ channel. The measured branching fractions are \B(\tau^{-}\to \pi^{-}\pi^{-}\pi^{+}\eta\nu_{\tau}) =(3.4^{+0.6}_{-0.5}\pm0.6)\times10^{-4} and \B(\tau^{-}\to \pi^{-}2\piz\eta\nu_{\tau} =(1.4\pm0.6\pm0.3)\times10^{-4}. We observe clear evidence for $f_1\to\eta\pi\pi$ substructure and measure \B(\tau^{-}\to f_1\pi^{-}\nu_{\tau})=(5.8^{+1.4}_{-1.3}\pm1.8)\times10^{-4}. We have also searched for $\eta'(958)$ production and obtain 90% CL upper limits \B(\tau^{-}\to \pi^{-}\eta'\nu_\tau)<7.4\times10^{-5} and \B(\tau^{-}\to \pi^{-}\piz\eta'\nu_\tau)<8.0\times10^{-5}.Comment: 11 page postscript file, postscript file also available through http://w4.lns.cornell.edu/public/CLN